Range Queries over a Compact Representation of Minimum Bounding Rectangles
نویسندگان
چکیده
In this paper we present a compact structure to index semistatic collections of MBRs that solves range queries while keeping a good trade-off between the space needed to store the index and its search efficiency. This is very relevant considering the current sizes and gaps in the memory hierarchy. Our index is based on the wavelet tree, a structure used to represent sequences, permutations, and other discrete functions in stringology. The comparison with the R*-tree and the STR R-tree (the most relevant dynamic and static versions of the R-tree) shows that our proposal needs less space to store the index while keeping competitive search performance, especially when the queries are not too selective.
منابع مشابه
A Fun Application of Compact Data Structures to Indexing Geographic Data
The way memory hierarchy has evolved in recent decades has opened new challenges in the development of indexing structures in general and spatial access methods in particular. In this paper we propose an original approach to represent geographic data based on compact data structures used in other fields such as text or image compression. A wavelet tree-based structure allows us to represent min...
متن کاملIndexing large geographic datasets with compact qualitative representation
This paper develops a new mechanism to efficiently compute and compactly store qualitative spatial relations between spatial objects, focusing on topological and directional relations for large datasets of region objects. The central idea is to use minimum bounding rectangles (MBRs) to approximately represent region objects with arbitrary shape and complexity and only store spatial relations wh...
متن کاملSpatial Relations, Minimum Bounding Rectangles, and Spatial Data Structures
Despite the attention that spatial relations have attracted in domains such as Spatial Query Languages, Image and Multimedia Databases, Reasoning and Geographic Applications, they have not been extensively applied in spatial access methods. This paper is concerned with the retrieval of topological and direction relations using spatial data structures based on Minimum Bounding Rectangles. We des...
متن کاملQMBRi: Inverse quantization of minimum bounding rectangles for spatial data compression
In this paper, we propose QMBRi, the inverse representation of the quantized minimum bounding rectangles (MBRs) scheme, which compresses a minimum bounding rectangle key into one byte for spatial-data compression. QMBRi is a novel spatial-data compression scheme that is based on inverse quantization and overcomes the shortcomings of conventional relative coordination or quantization schemes. If...
متن کاملEfficient Index Structures for String Databases
We consider the problem of substring searching in large databases. Typical applications of this problem are genetic data, web data, and event sequences. Since the size of such databases grows exponentially, it becomes impractical to use inmemory algorithms for these problems. In this paper, we propose to map the substrings of the data into an integer space with the help of wavelet coefficients....
متن کامل